Real waiting times for surgery. Proposal for an improved system for their management.

نویسندگان

  • Ignacio Abásolo
  • Patricia Barber
  • Beatriz González López-Valcárcel
  • Octavio Jiménez
چکیده

OBJECTIVES In Spain, official information on waiting times for surgery is based on the interval between the indication for surgery and its performance. We aimed to estimate total waiting times for surgical procedures, including outpatient visits and diagnostic tests prior to surgery. In addition, we propose an alternative system to manage total waiting times that reduces variability and maximum waiting times without increasing the use of health care resources. This system is illustrated by three surgical procedures: cholecystectomy, carpal tunnel release and inguinal/femoral hernia repair. METHODS Using data from two Autonomous Communities, we adjusted, through simulation, a theoretical distribution of the total waiting time assuming independence of the waiting times of each stage of the clinical procedure. We show an alternative system in which the waiting time for the second consultation is established according to the time previously waited for the first consultation. RESULTS Average total waiting times for cholecystectomy, carpal tunnel release and inguinal/femoral hernia repair were 331, 355 and 137 days, respectively (official data are 83, 68 and 73 days, respectively). Using different negative correlations between waiting times for subsequent consultations would reduce maximum waiting times by between 2% and 15% and substantially reduce heterogeneity among patients, without generating higher resource use. CONCLUSION Total waiting times are between two and five times higher than those officially published. The relationship between the waiting times at each stage of the medical procedure may be used to decrease variability and maximum waiting times.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Model for Scheduling Elective Surgeries for Minimizing the Waiting Times in Emergency Surgeries

The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that...

متن کامل

Appointment process of open-heart surgery in Shahid Rajaei Heart Hospital using a discrete event simulation approach

Background: The waiting list is a list of selected patients in the surgical queue. If demand exceeds capacity, the waiting list grows rapidly, which may lead to unacceptable waiting for patients, especially those in need of acute medical care. Patients waiting for heart surgery are placed on the waiting list for surgery, and sometimes the waiting time is longer than patients expect. Reducing th...

متن کامل

Long Waiting Times for Elective Hospital Care – Breaking the Vicious Circle by Abandoning Prioritisation

Background Policies assigning low-priority patients treatment delays for care, in order to make room for patients of higher priority arriving later, are common in secondary healthcare services today. Alternatively, each new patient could be granted the first available appointment. We aimed to investigate whether prioritisation can be part of the reason why waiting times for care are often...

متن کامل

A Simulation Approach to Evaluate Performance Indices of Fuzzy Exponential Queuing System (An M/M/C Model in a Banking Case Study)

This paper includes a simulation model built in order to predict the performance indicessuch aswaiting time by analyzing queue’s components in the real world under uncertain and subjective situation. The objective of this paper is to predict the waiting time of each customer in an M/M/C queuing model. In this regard, to enable decision makers to obtain useful results with enough knowledge on th...

متن کامل

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Gaceta sanitaria

دوره 28 3  شماره 

صفحات  -

تاریخ انتشار 2014